Inconsistency measures for probabilistic logics
نویسندگان
چکیده
منابع مشابه
Inconsistency measures for probabilistic logics
Inconsistencies in knowledge bases are of major concern in knowledge representation and reasoning. In formalisms that employ model-based reasoning mechanisms inconsistencies render a knowledge base useless due to the non-existence of a model. In order to restore consistency an analysis and understanding of inconsistencies is mandatory. Recently, the field of inconsistency measurement has gained...
متن کاملLinear Programs for Measuring Inconsistency in Probabilistic Logics
Inconsistency measures help analyzing contradictory knowledge bases and resolving inconsistencies. In recent years several measures with desirable properties have been proposed, but often these measures correspond to combinatorial or nonconvex optimization problems that are hard to solve in practice. In this paper, I study a new family of inconsistency measures for probabilistic knowledge bases...
متن کاملDistance-based Measures of Inconsistency and Incoherency for Description Logics
Inconsistency and incoherency are two sorts of erroneous information in a DL ontology which have been widely discussed in ontology-based applications. For example, they have been used to detect modeling errors during ontology construction. To provide more informative metrics which can tell the differences between inconsistent ontologies and between incoherent terminologies, there has been some ...
متن کاملProbabilistic Reasoning with Inconsistent Beliefs Using Inconsistency Measures
The classical probabilistic entailment problem is to determine upper and lower bounds on the probability of formulas, given a consistent set of probabilistic assertions. We generalize this problem by omitting the consistency assumption and, thus, provide a general framework for probabilistic reasoning under inconsistency. To do so, we utilize inconsistency measures to determine probability func...
متن کاملLogics of Deontic Inconsistency
The Logics of Formal Inconsistency (LFIs) are paraconsistent logics which internalize the notions of consistency and inconsistency by means of connectives. Based on that idea, in this paper we propose two deontic systems in which contradictory obligations are allowed, without trivializing the system. Thus, from conflicting obligations Oφ and O¬φ contained in (or derived from) an information set...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2013
ISSN: 0004-3702
DOI: 10.1016/j.artint.2013.02.001